A neural network model for scheduling problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Neural Network Model to Solve DEA Problems

The paper deals with Data Envelopment Analysis (DEA) and Artificial Neural Network (ANN). We believe that solving for the DEA efficiency measure, simultaneously with neural network model, provides a promising rich approach to optimal solution. In this paper, a new neural network model is used to estimate the inefficiency of DMUs in large datasets.

متن کامل

a neural network model to solve dea problems

the paper deals with data envelopment analysis (dea) and artificial neural network (ann). we believe that solving for the dea efficiency measure, simultaneously with neural network model, provides a promising rich approach to optimal solution. in this paper, a new neural network model is used to estimate the inefficiency of dmus in large datasets.

متن کامل

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

متن کامل

Competitive neural network to solve scheduling problems

Most scheduling problems have been demonstrated to be NP-complete problems. The Hop"eld neural network is commonly applied to obtain an optimal solution in various di!erent scheduling applications, such as the traveling salesman problem (TSP), a typical discrete combinatorial problem. Hop"eld neural networks, although providing rapid convergence to the solution, require extensive e!ort to deter...

متن کامل

A Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 1996

ISSN: 0377-2217

DOI: 10.1016/0377-2217(96)00041-0